A unified formulation of Kautz network and generalized hypercube
نویسندگان
چکیده
منابع مشابه
Primitives on the Generalized Hypercube Network
E cient interprocessor communication is crucial to increasing the performance of parallel computers. In this paper, a special framework is developed on the generalized hypercube, a network that is currently receiving considerable attention. Using this framework as the basic tool, a number of spanning graphs with special properties to t various communication needs, are constructed on the network...
متن کاملEvaluating the communications capabilities of the generalized hypercube interconnection network
This paper presents results of evaluating the communications capabilities of the generalized hypercube interconnection network. The generalized hypercube has outstanding topological properties, but it has not been implemented on a large scale because of its very high wiring complexity. For this reason, this network has not been studied extensively in the past. However, recent and expected techn...
متن کاملOn the number of cycles in generalized Kautz digraphs
In this paper, we count cycles in a generalized Kautz digraph GK (n; d). Let n = pd such that d| ,p. Also let gl = gcd(d − (−1)l; n). We show that if one of the following conditions holds: • p6 √ d7 d+1 and k6 logd n+ 1, • √ d7 d+1 ¡p¡d (d+ 1) and k6 logd ( n 3 √ p2(d+1) ) + 10 3 , • d(d+ 1)¡p and k6 logd ( n d+1 ) then the number of cycles of length k in GK (n; d) is given by 1 k ∑ l | k ( k l...
متن کاملOn the decycling number of generalized Kautz digraphs
A set of vertices of a graph whose removal leaves an acyclic graph is called a decycling set of the graph. The minimum size of a decycling set of a graph G is referred to as the decycling number ofG. Let f(d, n) be the decycling number of the generalized Kautz digraph GK(d, n). In this paper, we obtain the upper bound of f(d, n) for all n ≥ d ≥ 2.
متن کاملPerfect Difference Network and Hypercube : A Study
In this paper, we have used the concept of graph theory to study the architecture of perfect difference network and hypercube.The study of comparision of perfect difference network and hypercube shows the performance and robustness of the two architectures. The topological properties of the two architectures are presented in the form of lemmas. We have made attempts to study the circuits to sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2005
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2004.11.012